Near-Optimal Algorithm for Group Scheduling in OBS Networks
نویسندگان
چکیده
منابع مشابه
Optimal algorithms for the batch scheduling problem in OBS networks
This paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. The consideration of previously scheduled bursts in the scheduling allows such modeling. Two optimal algorithms with polynomial time complexity are derived and evaluated. Result...
متن کاملGroup-scheduling for optical burst switched (OBS) networks
1 Currently with the School of Electronic Engineering, Soongsil University, Seoul, Korea ([email protected]). This work was carried out at Alcatel where he was on a sabbatical leave. Abstract— To date, all of the proposals for burst-scheduling techniques have considered scheduling individual bursts. We introduce a new scheme called OBS group scheduling. In this approach, a burst is represented b...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks
We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as the maximization of a monotone set function under a matroid constraint. We propose a randomized greedy algorithm that is significantly faster than state-of-...
متن کاملProbabilistic Preemptive Scheduling for Service Differentiation in OBS Networks
This paper presents a Probabilistic Preemptive (PP) scheduling discipline for service differentiation in Optical Burst Switching (OBS) networks. The main idea of PP is that a probabilistic parameter is added to the preemptive scheduling discipline. With PP, a high priority burst preempts a low priority burst in a probabilistic manner. By changing the probabilistic parameter, PP can achieve flex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2015
ISSN: 1225-6463
DOI: 10.4218/etrij.15.2415.0019